Thresholds for Correcting Errors, Erasures, and Faulty Syndrome Measurements in Degenerate Quantum Codes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thresholds for Correcting Errors, Erasures, and Faulty Syndrome Measurements in Degenerate Quantum Codes.

We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to scalable quantum computation applicable to degenerate quantum codes with sublinear distance scaling. We give explicit analytic expressions combining probabilities of erasures, depolarizing errors, and phenomenological syndrome measurement errors for quantum low-density parity-check codes with lo...

متن کامل

Codes Correcting Phased Burst Erasures

We introduce a family of binary array codes of size t n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e. being considered as codes over GF (2 t ) they are MDS. The length of the codes is n = P L `=1 t ` , where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL, where r is the numb...

متن کامل

A new decoding algorithm for correcting both erasures and errors of Reed-Solomon codes

In this paper, a high efficient decoding algorithm is developed here in order to correct both erasures and errors for Reed–Solomon (RS) codes based on the Euclidean algorithm together with the Berlekamp–Massey (BM) algorithm. The new decoding algorithm computes the errata locator polynomial and the errata evaluator polynomial simultaneously without performing polynomial divisions, and there is ...

متن کامل

Errors-and-erasures Decoding of Bch Codes

We give a Grr obner basis algorithm for errors-and-erasures decoding of BCH codes that avoids computation of the modiied syndrome polynomial. The decoding problem is viewed as an instance of a more general interpolation problem. Our algorithm has the same computational complexity as the Berlekamp{Massey algorithm but is more eecient in hardware.

متن کامل

Spatially correlated qubit errors and burst-correcting quantum codes

We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of burst errors in classical coding theory. We present several different efficient schemes for constructing families of such codes. For example, we construct a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 2015

ISSN: 0031-9007,1079-7114

DOI: 10.1103/physrevlett.115.050502